Weakly Distance-Regular Digraphs of One Type of Arcs
نویسندگان
چکیده
In this paper, we classify all commutative weakly distance-regular digraphs of girth g and one type arcs under the assumption that \(p_{(1,g-1),(1,g-1)}^{(2,g-2)}\ge k_{1,g-1}-2\). consequence, Yang et al. (J Comb Theory Ser A 160:288–315, 2018, Theorem 1.1) is partially generalized by our result.
منابع مشابه
Weakly Distance-Regular Digraphs of Girth 2
In this paper, we give two constructions of weakly distance-regular digraphs of girth 2, and prove that certain quotient digraph of a commutative weakly distancetransitive digraph of girth 2 is a distance-transitive graph. As an application of the result, we not only give some constructions of weakly distance-regular digraphs which are not weakly distance-transitive, but determine a special cla...
متن کاملA family of weakly distance-regular digraphs of girth 2
All weakly distance-regular digraphs with girth 2 and k − k1,1 = 1 are determined. Moreover, all such digraphs are commutative.
متن کاملTitle : A Family of Weakly Distance - Regular Digraphs of Girth
All weakly distance-regular digraphs with girth $2$ and k-k_{1,1}=1 are classified. A Family of Weakly Distance-Regular Digraphs of Girth 2 Kaishun Wang∗ School of Mathematical Sciences Beijing Normal University Beijing 100875, P.R. China Abstract All weakly distance-regular digraphs with girth 2 and k − k1,1 = 1 are classified.All weakly distance-regular digraphs with girth 2 and k − k1,1 = 1 ...
متن کاملCommutative weakly distance-regular digraphs of girth 2
We introduce some constructions of weakly distance-regular digraphs of girth 2, and prove that a certain quotient digraph of a commutative weakly distance-transitive digraph of girth 2 is a distancetransitive graph. As an application of the result, we obtain some examples of weakly distanceregular digraphs which are not weakly distance-transitive. Moreover, a class of commutative weakly distanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2022
ISSN: ['1435-5914', '0911-0119']
DOI: https://doi.org/10.1007/s00373-022-02493-z